Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis
Identifieur interne : 008E81 ( Main/Exploration ); précédent : 008E80; suivant : 008E82Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis
Auteurs : Gerd Stumme ; Rafik Taouil ; Yves Bastide ; Nicolas Pasquier ; Lotfi LakhalSource :
English descriptors
Abstract
Association rules are used to investigate large databases. The analyst is usually confronted with large lists of such rules and has to find the most relevant ones for his purpose. Based on results about knowledge representation within the theoretical framework of Formal Concept Analysis, we present relatively small bases for association rules from which all rules can be deduced. We also provide algorithms for their calculation.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 003116
- to stream Crin, to step Curation: 003116
- to stream Crin, to step Checkpoint: 001497
- to stream Main, to step Merge: 009402
- to stream Main, to step Curation: 008E81
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="532">Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis</title></titleStmt><publicationStmt><idno type="RBID">CRIN:stumme01a</idno><date when="2001" year="2001">2001</date><idno type="wicri:Area/Crin/Corpus">003116</idno><idno type="wicri:Area/Crin/Curation">003116</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">003116</idno><idno type="wicri:Area/Crin/Checkpoint">001497</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">001497</idno><idno type="wicri:Area/Main/Merge">009402</idno><idno type="wicri:Area/Main/Curation">008E81</idno><idno type="wicri:Area/Main/Exploration">008E81</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis</title><author><name sortKey="Stumme, Gerd" sort="Stumme, Gerd" uniqKey="Stumme G" first="Gerd" last="Stumme">Gerd Stumme</name></author><author><name sortKey="Taouil, Rafik" sort="Taouil, Rafik" uniqKey="Taouil R" first="Rafik" last="Taouil">Rafik Taouil</name></author><author><name sortKey="Bastide, Yves" sort="Bastide, Yves" uniqKey="Bastide Y" first="Yves" last="Bastide">Yves Bastide</name></author><author><name sortKey="Pasquier, Nicolas" sort="Pasquier, Nicolas" uniqKey="Pasquier N" first="Nicolas" last="Pasquier">Nicolas Pasquier</name></author><author><name sortKey="Lakhal, Lotfi" sort="Lakhal, Lotfi" uniqKey="Lakhal L" first="Lotfi" last="Lakhal">Lotfi Lakhal</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>association rules</term><term>formal concept analysis</term><term>knowledge representation</term><term>large databases</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="753">Association rules are used to investigate large databases. The analyst is usually confronted with large lists of such rules and has to find the most relevant ones for his purpose. Based on results about knowledge representation within the theoretical framework of Formal Concept Analysis, we present relatively small bases for association rules from which all rules can be deduced. We also provide algorithms for their calculation.</div></front></TEI><affiliations><list></list><tree><noCountry><name sortKey="Bastide, Yves" sort="Bastide, Yves" uniqKey="Bastide Y" first="Yves" last="Bastide">Yves Bastide</name><name sortKey="Lakhal, Lotfi" sort="Lakhal, Lotfi" uniqKey="Lakhal L" first="Lotfi" last="Lakhal">Lotfi Lakhal</name><name sortKey="Pasquier, Nicolas" sort="Pasquier, Nicolas" uniqKey="Pasquier N" first="Nicolas" last="Pasquier">Nicolas Pasquier</name><name sortKey="Stumme, Gerd" sort="Stumme, Gerd" uniqKey="Stumme G" first="Gerd" last="Stumme">Gerd Stumme</name><name sortKey="Taouil, Rafik" sort="Taouil, Rafik" uniqKey="Taouil R" first="Rafik" last="Taouil">Rafik Taouil</name></noCountry></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 008E81 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 008E81 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= CRIN:stumme01a
|texte= Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis
}}
| This area was generated with Dilib version V0.6.33. |  |